An algorithmic theory of learning: Robust concepts and random projection
نویسندگان
چکیده
منابع مشابه
an investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols
this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...
an investigation into the impact of m-game-enhanced blended module of teaching and learning on iranian students english literacy skills and subskills learning
پژوهش حاضر با پیوند رسانه های قدیمی و جدید یاد دهی و یادگیری _طرح داستان و بازی های همراه ــ در یک پو دمان ترکیبی، در صدد قیاس شیوه ی یاد دهی و یادگیری مبتنی بر بازی مهارت های فرعی و اصلی واژگان، خواندن و نوشتار سواد انگلیسی با شیوه های مرسوم آن بود. به این منظور با کاربرد یک طرح سه گانه همراه با الگوی نظام آموزشی (تومی، 2010)، بازی های از پیش ساخته شده و بومی قابل عرضه از طریق ارتباطات سیّار (ب...
Algorithmic theory of random graphs
The theory of random graphs has been mainly concerned with structural properties, in particular the most likely values of various graph invariants – see Bollobàs [21]. There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this paper we survey some of the results in this area.
متن کاملCoherent Concepts, Robust Learning
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. This is natural in cognitive learning situations, where multiple learning problems co-exist but their predictions are constrained to produce a valid sentence, image or any other domain representation. Our theory addresses tw...
متن کاملRandom Projection-Based Anderson-Darling Test for Random Fields
In this paper, we present the Anderson-Darling (AD) and Kolmogorov-Smirnov (KS) goodness of fit statistics for stationary and non-stationary random fields. Namely, we adopt an easy-to-apply method based on a random projection of a Hilbert-valued random field onto the real line R, and then, applying the well-known AD and KS goodness of fit tests. We conclude this paper by studying the behavior o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2006
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-006-6265-7